ON THE COMPUTATIONAL COMPLEXITY OF ANALOGY DERIVATION IN STRUCTURE-MAPPING THEORY by
نویسندگان
چکیده
Faculty of Computer Science, University of New Brunswick Fredericton, 1 Fredericton, NB, Canada Department of Computer Science, Memorial University of Newfoundland, 2 St. John’s, NF, Canada Abteilung für Mathematishe Logik, Albert-Ludwigs-Universität Freiburg, 3 Freiburg, Germany Nijmegen Institute for Cognition and Information, Radboud University 4 Nijmegen, Nijmegen, The Netherlands Department of Computer Science, Memorial University of Newfoundland, 5 St. John’s, NL, Canada
منابع مشابه
What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective
Solving new problems can be made easier if one can build on experiences with other problems one has already successfully solved. The ability to exploit earlier problem-solving experiences in solving new problems seems to require several cognitive sub-abilities. Minimally, one needs to be able to retrieve relevant knowledge of earlier solved problems and their solutions (solved-exemplar retrieva...
متن کاملIdentifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping
Many computational models in cognitive science and artificial intelligence face the problem of computational intractability when assumed to operate for unrestricted input domains. Tractability may be achieved by restricting the input domain, but some degree of generality is typically required to model human-like intelligence. Moreover, it is often non-obvious which restrictions will render a mo...
متن کاملConstraints on Analogical Mapping: A Comparison of Three Models
Three theories of analogy have been proposed that are supported by computational models and data from experiments on human analogical abilities. In this article we show how these theories can be unified within a common metatheoretical framework that distinguishes among levels of informational, behavioral, and hardware constraints. This framework clarifies the distinctions among three computatio...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملConstraints on Analogical Mapping: A Comparison of Three Models By
Three theories of analogy have been proposed which are supported by computational models and data from experiments on human analogical abilities. In this paper, we show how these theories can be unified within a common metatheoretical framework which distinguishes between levels of informational, behavioural and hardware constraints. This framework makes clear the distinctions between three com...
متن کامل